#include <bits/stdc++.h>
using namespace std;
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
using ll = long long;
const ll N = 2e5 + 10;
ll a[N], b[N];
void solve()
{
    ll n, m;
    cin >> n >> m;
    for (ll i = 1; i <= n; i++)
    {
        cin >> a[i];
    }
    for (ll i = 1; i <= m; i++)
    {
        cin >> b[i];
    }
    sort(b + 1, b + m + 1);
    for (ll i = 1; i <= n; i++)
    {
        if (i == 1)
        {
            a[i] = min(a[i], b[1]- a[i]);
        }
        else
        {
            ll l = 1, r = m,pos=1;
            while (l < r)
            {
                ll m =  (r + l) / 2;
                if (b[m] - a[i ] < a[i - 1])
                {
                    l = m + 1;
                    pos = l;
                }
                else
                {
                    r = m;
                }
            }
            ll minn = min(b[pos] - a[i], a[i]), maxn = max(b[pos] - a[i], a[i]);
            if (minn >= a[i - 1])
            {
                a[i] = minn;
            }
            else if (maxn >= a[i - 1])
            {
                a[i] = maxn;
            }
            else
            {
                no;
                return;
            }
        }
    }
    yes;
}
int main()
{
    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}
